Hybrid implicit steepest-descent methods for triple hierarchical variational inequalities with hierarchical variational inequality constraints

Finite-Step Relaxed Hybrid Steepest-Descent Methods for Variational Inequalities

Hybrid Steepest Descent Method for Solving Hierarchical Fixed Point Approach to Variational Inequalities Constrained Optimization Problem

An explicit hierarchical fixed point algorithm is introduced to solve the monotone variational inequality over the fixed point set of a nonexpansive mapping. This paper discusses a monotone variational inequality with variational constraint and convex optimization problems over the fixed point set of a nonexpansive mapping. The strong convergence for the proposed algorithm to the solution is gu...

Mann-type Steepest-descent and Modified Hybrid Steepest-descent Methods for Variational Inequalities in Banach Spaces

1Department of Mathematics, Shanghai Normal University, Shanghai; and Scientific Computing Key Laboratory of Shanghai Universities, Shanghai, China 2Department of Mathematics & Statistics, College of Science, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia; and Department of Mathematics, Aligarh Muslim University, Aligarh, India 3Department of Applied Mathematics, National S...

Strong Weak Convergence Theorems of Implicit Hybrid Steepest-descent Methods for Variational Inequalities

Assume that F is a nonlinear operator on a real Hilbert space H which is strongly monotone and Lipschitzian with constants η > 0 and κ > 0, respectively on a nonempty closed convex subset C of H . Assume also that C is the intersection of the fixed point sets of a finite number of nonexpansive mappings on H . We develop an implicit hybrid steepest-descent method which generates an iterative seq...

Multistep Hybrid Extragradient Method for Triple Hierarchical Variational Inequalities

and Applied Analysis 3 where A n = α n I + A for all n ≥ 0. In particular, if V ≡ 0, then (11) reduces to the following iterative scheme: x 0 = x ∈ C chosen arbitrarily, y n = P C (x n − ] n A n x n ) , z n = β n x n + γ n P C (x n − ] n A n y n ) + σ n TP C (x n − ] n A n y n ) , x n+1 = P C [λ n (1 − δ n ) γSx n + (I − λ n μF) z n ] , ∀n ≥ 0. (12) Further, if S = V, then (11) reduces to the f...